Average transmission probability of a random stack

نویسندگان

  • Yin Lu
  • Christian Miniatura
چکیده

The transmission through a stack of identical slabs that are separated by gaps with random widths is usually treated by calculating the average of the logarithm of the transmission probability. We show how to calculate the average of the transmission probability itself with the aid of a recurrence relation and derive analytical upper and lower bounds. The upper bound, when used as an approximation for the transmission probability, is unreasonably good and we conjecture that it is asymptotically exact. PACS numbers: 42.25.Dd

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transmission of Cholera Disease with Laplacian and Triangular Parameters

A mathematical model has been introduced for the transmission dynamics of cholera disease by GQ Sun et al. recently. In this study, we add Laplacian and Triangular random effects to this model and analyze the variation of results for both cases. The expectations  and coefficients of variation are compared for the random models and the results are used to comment on the differences and similarit...

متن کامل

Study of Random Biased d-ary Tries Model

Tries are the most popular data structure on strings. We can construct d-ary tries by using strings over an alphabet leading to d-ary tries. Throughout the paper we assume that strings stored in trie are generated by an appropriate memory less source. In this paper, with a special combinatorial approach we extend their analysis for average profiles to d-ary tries. We use this combinatorial appr...

متن کامل

On the Error Probability of General Trellis Codes with Applications to Sequential Decoding

An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = l/n is given which separates the effects of the tail length T and the memory length M of the code. It is shown that the bound is independent of the length L of the information sequence when M 2 T + [nEvu(R)]-’ log, L. The implication that the actual...

متن کامل

Plasmonic Thermal Conductance of Stack of Metallic Nanorings

In this paper, we study the plasmonic thermal conductance of ordered stacks of metallic nanorings in a host material. Using second quantized formalism of the Random Phase Approximation, we first determine the dispersion relations of surface plasmon waves on the stacks of nanorings. Then, using Landauer-Buttiker formalism, we determine the coefficient of plasmonic thermal conductance and heat cu...

متن کامل

Sequential decoding for lossless streaming source coding with side information

The problem of lossless fixed-rate streaming coding of discrete memoryless sources with side information at the decoder is studied. A random time-varying tree-code is used to sequentially bin strings and a Stack Algorithm with a variable bias uses the side information to give a delay-universal coding system for lossless source coding with side information. The scheme is shown to give exponentia...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009